Learning On the Way

Euclidean algorithm (The time complexity of this algorithm is O(log(min(a, b)))

 def gcd(a, b):
    if a < b:
        a, b = b, a
    while b > 0:
        a, b = b, a % b
    return a

The least common multiple can be found by the following

def lcm(a, b):
    return a * b // gcd(a, b)